(local minimization problem)

См. также в других словарях:

• Expenditure minimization problem — In microeconomics, the expenditure minimization problem is another perspective on the utility maximization problem: how much money do I need to be happy? . This question comes in two parts. Given a consumer s utility function, prices, and a… …   Wikipedia

• Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… …   Wikipedia

• Energy minimization — (energy optimization) methods are common techniques to compute the equilibrium configuration of molecules. The basic idea is that a stable state of a molecular system should correspond to a local minimum of their potential energy. This kind of… …   Wikipedia

• Economic calculation problem — The economic calculation problem is a criticism of socialist economics. It was first proposed by Ludwig von Mises in 1920 and later expounded by Friedrich Hayek.cite book title= Economic calculation in the Socialist Commonwealth accessdate=2008… …   Wikipedia

• Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

• Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find …   Wikipedia

• Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… …   Wikipedia

• Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… …   Wikipedia

• Lagrange multiplier — Figure 1: Find x and y to maximize f(x,y) subject to a constraint (shown in red) g(x,y) = c …   Wikipedia

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia